A variant of the Hadwiger-Debrunner (p, q)-problem in the plane

نویسندگان

  • Sathish Govindarajan
  • Gabriel Nivasch
چکیده

Let X be a convex curve in the plane (say, the unit circle), and let S be a family of planar convex bodies, such that every two of them meet at a point of X. Then S has a transversal N ⊂ R of size at most 1.75 · 10. Suppose instead that S only satisfies the following “(p, 2)-condition”: Among every p elements of S there are two that meet at a common point of X. Then S has a transversal of size O(p). For comparison, the best known bound for the Hadwiger–Debrunner (p, q)-problem in the plane, with q = 3, is O(p). Our result generalizes appropriately for R if X ⊂ R is, for example, the moment curve.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A purely combinatorial proof of the Hadwiger Debrunner (p, q) Conjecture

Abstract A family of sets has the (p, q) property if among any p members of the family some q have a nonempty intersection. The authors have proved that for every p ≥ q ≥ d+ 1 there is a c = c(p, q, d) < ∞ such that for every family F of compact, convex sets in R which has the (p, q) property there is a set of at most c points in R that intersects each member of F , thus settling an old problem...

متن کامل

Piercing convex sets and the Hadwiger Debrunner (p, q)-problem

A family of sets has the (p, q) property if among any p members of the family some q have a nonempty intersection. It is shown that for every p ≥ q ≥ d + 1 there is a c = c(p, q, d) < ∞ such that for every family F of compact, convex sets in R which has the (p, q) property there is a set of at most c points in R that intersects each member of F . This settles an old problem of Hadwiger and Debr...

متن کامل

A Purely Combinatorial Proof of the Hadwiger Debrunner

A family of sets has the (p; q) property if among any p members of the family some q have a nonempty intersection. The authors have proved that for every p q d + 1 there is a c = c(p; q; d) < 1 such that for every family F of compact, convex sets in R d which has the (p; q) property there is a set of at most c points in R d that intersects each member of F, thus settling an old problem of Hadwi...

متن کامل

Improved bounds on the Hadwiger-Debrunner numbers

We prove that any family of compact convex sets in R which satisfy the (p, q)-property (p ≥ q ≥ d+1) can be pierced with Õ((pq) q−1 q−d ) points for d ≥ 3 and O((pq) q−1 q−2 ) for d = 2. This improves (already for d = 2 and q = 3) the previously best known bound (of Õ(p 2+d)) provided in Alon and Kleitman’s celebrated proof of the Hadwiger Debrunner conjecture (for the case q = d+ 1). We also p...

متن کامل

Chromatic numbers for the hyperbolic plane and discrete analogs

Abstract. We study colorings of the hyperbolic plane, analogously to the Hadwiger-Nelson problem for the Euclidean plane. The idea is to color points using the minimum number of colors such that no two points at distance exactly d are of the same color. The problem depends on d and, following a strategy of Kloeckner, we show linear upper bounds on the necessary number of colors. In parallel, we...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete & Computational Geometry

دوره 54  شماره 

صفحات  -

تاریخ انتشار 2015